منابع مشابه
Logic and proof method of recursion
1 What makes a useful calculus? 7 1.0 The r^ ole of proofs and calculi in program development : 9 1.1 Choice of the proof 5 Conclusion 133 xii CONTENTS Chapter 0 Introduction Today there is general agreement that program development is important and diicult. Much research has been done and still is done, in order to make program development reliable and manageable. The main ingredients of progr...
متن کاملPartiality and Recursion in Higher-Order Logic
We present an illative system Is of classical higher-order logic with subtyping and basic inductive types. The system Is allows for direct definitions of partial and general recursive functions, and provides means for handling functions whose termination has not been proven. We give examples of how properties of some recursive functions may be established in our system. In a technical appendix ...
متن کاملTesting Hennessy-Milner Logic with Recursion
This study o ers a characterization of the collection of properties expressible in Hennessy-Milner Logic (HML) with recursion that can be tested using nite LTSs. In addition to actions used to probe the behaviour of the tested system, the LTSs that we use as tests will be able to perform a distinguished action nok to signal their dissatisfaction during the interaction with the tested process. A...
متن کاملL-Recursion and a new Logic for Logarithmic Space
We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space. The resulting logic LREC has a data complexity in LOGSPACE, and it defines LOGSPACE-complete problems like deterministic reachability and Boolean formula evaluation. We prove that LREC is strictly more expressive than deterministic tran...
متن کاملSafe Recursion on Notation into a Light Logic by Levels
We embed Safe Recursion on Notation (SRN) into Light Affine Logic by Levels (LALL), derived from the logic ML4. LALL is an intuitionistic deductive system, with a polynomial time cut elimination strategy. The embedding allows to represent every term t of SRN as a family of nets 〈⌈t⌉〉l∈N in LALL. Every net ⌈t⌉l in the family simulates t on arguments whose bit length is bounded by the integer l. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1989
ISSN: 0890-5401
DOI: 10.1016/0890-5401(89)90069-2